THE TRANSITIVE CLOSURE OF FUZZY RELATIONS WITH A CONTRACTION PROPERTY
نویسندگان
چکیده
منابع مشابه
Transitive Closure of Fuzzy Relations
In this paper X, Y denote non empty sets. Let X be a non empty set. Observe that every membership function of X is real-yielding. Let f , g be real-yielding functions. The predicate f ⊑ g is defined by: (Def. 1) dom f ⊆ dom g and for every set x such that x ∈ dom f holds f(x) ¬ g(x). Let X be a non empty set and let f , g be membership functions of X. Let us observe that f ⊑ g if and only if: (...
متن کاملTransitive Closure of Interval-valued Fuzzy Relations
In this paper are introduced some concepts of interval-valued fuzzy relations and some of their properties: reflexivity, symmetry, T-transitivity, composition and local reflexivity. The existence and uniqueness of T-transitive closure of interval-valued fuzzy relations is proved. An algorithm to compute the T-transitive closure of finite interval-valued fuzzy relations is showed. Some propertie...
متن کاملEvent Matching Using the Transitive Closure of Dependency Relations
This paper describes a novel event-matching strategy using features obtained from the transitive closure of dependency relations. The method yields a model capable of matching events with an F-measure of 66.5%.
متن کاملDirect Algorithms for Computing the Transitive Closure of Database Relations
We present new algorithms for computing the transitive closure of large database relations. Unlike iterative algorithms, such as the semi-naive and the logarithmic algorithms, the termination of our algorithms does not depend on the length of paths in the underlying graph (hence, the name direct algorithms). We also present simulation results that show that these direct algorithms perform unifo...
متن کاملOn the transitive closure of reciprocal [0, 1]-valued relations
We build a theoretical framework that enables to extend the concept of transitive closure to the class of complete crisp relations, the class of reciprocal 3-valued relations and the class of reciprocal [0, 1]valued relations. We present algorithms to compute the transitive closure of reciprocal [0, 1]-valued relations, where the type of transitivity is either weak stochastic transitivity or st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 1995
ISSN: 0286-522X
DOI: 10.5109/13446